Polynomial continuity on $\ell _1$
نویسندگان
چکیده
منابع مشابه
Performance of first- and second-order methods for \(\ell _1\) -regularized least squares problems
We study the performance of firstand second-order optimization methods for `1-regularized sparse least-squares problems as the conditioning of the problem changes and the dimensions of the problem increase up to one trillion. A rigorously defined generator is presented which allows control of the dimensions, the conditioning and the sparsity of the problem. The generator has very low memory req...
متن کاملMaximum Consensus Parameter Estimation by Reweighted \ell _1 ℓ 1 Methods
Robust parameter estimation in computer vision is frequently accomplished by solving the maximum consensus (MaxCon) problem. Widely used randomized methods for MaxCon, however, can only produce random approximate solutions, while global methods are too slow to exercise on realistic problem sizes. Here we analyse MaxCon as iterative reweighted algorithms on the data residuals. We propose a smoot...
متن کاملA variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell _1\) -regularized least-squares
The problem of finding sparse solutions to underdetermined systems of linear equations is very common in many fields as e.g. in signal/image processing and statistics. A standard tool for dealing with sparse recovery is the l1-regularized least-squares approach that has recently attracted the attention of many researchers. In this paper, we describe a new version of the two-block nonlinear cons...
متن کاملΣ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1
We rst prove a theorem about reals (subsets of N) and classes of reals: If a real X is 1 in every member G of a nonempty 1 1 class K of reals then X is itself 1. We also explore the relationship between this theorem, various basis results in hyperarithmetic theory and omitting types theorems in !-logic. We then prove the analog of our rst theorem for classes of reals: If a class A of reals is...
متن کاملA $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1997
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-97-03733-7